Novel systolic architecture of fast biased polynomial transformWANG, S.-S; LIN, T.-P; WU, J.-L et al.International journal of mini & microcomputers. 1987, Vol 9, Num 1, pp 28-31, issn 0702-0481Article

Fast biased polynomial transformsJA-LING WU; SOO-CHANG PEI.IEEE transactions on acoustics, speech, and signal processing. 1986, Vol 34, Num 2, pp 383-385, issn 0096-3518Article

On the computation of autocorrelation using polynomial transformsPRAKASH, S; RAO, V. V.IEEE transactions on acoustics, speech, and signal processing. 1984, Vol 32, Num 2, pp 448-450, issn 0096-3518Article

NP-hardness of the cluster minimization problem revisitedADIB, Artur B.Journal of physics. A, mathematical and general. 2005, Vol 38, Num 40, pp 8487-8492, issn 0305-4470, 6 p.Article

Improved long convolutions using generalized number theoretic and polynomial transformsSOO-CHANG PEI; JA-LING WU.IEEE transactions on acoustics, speech, and signal processing. 1985, Vol 33, Num 6, pp 1626-1627, issn 0096-3518Article

Fast biased polynomial transforms for 2D prime lengths discrete Fourier TransformsJA-LING WU; SOO-CHANG PEI.Electronics Letters. 1984, Vol 20, Num 22, pp 933-934, issn 0013-5194Article

Variable transformations in the numerical solution of second kind Volterra integral equations with continuous and weakly singular kernels; extensions to Fredholm integral equationsGALPERIN, E. A; KANSA, E. J; MAKROGLOU, A et al.Journal of computational and applied mathematics. 2000, Vol 115, Num 1-2, pp 193-211, issn 0377-0427Conference Paper

FILTRAGE NUMERIQUE RAPIDE PAR TRANSFORMEES DE FOURIER ET TRANSFORMEES POLYNOMIALES: ETUDE DE L'IMPLANTATION SUR MICROPROCESSEURSQUANDALLE PHILIPPE.1979; ; FRA; DA. 1979; 286; 166-24 P.; 30 CM; BIBL. 20 REF.; TH. 3EME CYCLE: MATH./MICE/1979Thesis

FLEXIBILITY IN THE LENGTH OF CONVOLUTIONS COMPUTED USING FOURIER-LIKE FAST TRANSFORM ALGORITHMSARAMBEPOLA B; RAYNER PJW.1980; SIGNAL PROCESS; NLD; DA. 1980; VOL. 2; NO 1; PP. 31-38; ABS. GER/FRE; BIBL. 14 REF.Article

INSTABILITY OF AN AREA-PRESERVING POLYNOMIAL MAPPING.BARTLETT JH.1978; CELEST. MECH.; NLD; DA. 1978; VOL. 17; NO 1; PP. 3-36; BIBL. 15 REF.Article

A note on the polynomial form of Boolean functions and related topicsFALKOWSKI, B. J.IEEE transactions on computers. 1999, Vol 48, Num 8, pp 860-864, issn 0018-9340Article

A set of one-to-one two-dimensional biquadratic transformationsGE, Y.-R; FITZPATRICK, J. M.Computers & mathematics with applications (1987). 1994, Vol 27, Num 11, pp 13-25, issn 0898-1221Article

Improved fast polynomial transform algorithm for cyclic convolutionsMING LOH, A; WAN-CHI SIU.Circuits, systems, and signal processing. 1995, Vol 14, Num 5, pp 603-614, issn 0278-081XArticle

Discrete convolution calculation algorithms employing number-theoretic transformations in single-modulus and multimodulus residue arithmeticSHATALOV, A. A.Telecommunications & radio engineering. 1993, Vol 48, Num 1, pp 28-33, issn 0040-2508Article

Design of state-variable SC filters by means of polynomial transformationDAVIS, A. M; SMITH, R. R.IEEE transactions on circuits and systems. 1986, Vol 33, Num 12, pp 1248-1251, issn 0098-4094Article

A new fast algorithm of Mersenne Transform and it applicationLIU LIANG; SUN QI.International Conference on Signal Processing. 2004, pp 113-116, isbn 0-7803-8406-7, 4 p.Conference Paper

Multidimensional polynomial transform algorithm for multidimensional discrete W transformYONGHONG ZENG; XIAOMEI LI.IEEE transactions on signal processing. 1999, Vol 47, Num 7, pp 2050-2052, issn 1053-587XArticle

Digital SAR processing using a fast polynomial transformTRUONG, T. K; REED, I. S; LIPES, R. G et al.IEEE transactions on acoustics, speech, and signal processing. 1984, Vol 32, Num 2, pp 419-425, issn 0096-3518Article

COMPUTATION OF CONVOLUTION AND DISCRETE FOURIER TRANSFORMS BY POLYNOMIAL TRANSFORMS.NUSSBAUMER HJ; QUANDALLE P.1978; IBM J. RES. DEVELOP.; USA; DA. 1978; VOL. 22; NO 2; PP. 134-144; BIBL. 18 REF.Article

D.F.T. COMPUTATION BY FAST POLYNOMIAL TRANSFORM ALGORITHMSNUSSBAUMER HJ.1979; ELECTRON. LETTERS; GBR; DA. 1979; VOL. 15; NO 22; PP. 701-702; BIBL. 7 REF.Article

REDUCTION DE CLICHES DE CHAMPS STELLAIRES PRIS PAR TELEVISION AVEC INTENSIFICATEUR D'IMAGE.DEBEHOGNE H; VAN HEMELRIJCK E.1977; ASTR. AND ASTROPHYS.; GERM.; DA. 1977; VOL. 54; NO 1; PP. 273-276; ABS. ANGL.; BIBL. 11 REF.Article

REDUCED DATE RE-ORDER COMPLEXITY PROPERTIES OF POLYNOMIAL TRANSFORM 2D CONVOLUTION AND FOURIER TRANSFORM METHODSKRIZ TA.1982; IBM JOURNAL OF RESEARCH AND DEVELOPMENT; ISSN 0018-8646; USA; DA. 1982; VOL. 26; NO 6; PP. 708-714; BIBL. 11 REF.Article

NEW POLYNOMIAL TRANSFORM ALGORITHMS FOR MULTIDIMENSIONAL DFT'S AND CONVOLUTIONSNUSSBAUMER HJ.1981; IEEE TRANS. ACOUST. SPEECH SIGNAL PROCESS.; ISSN 0096-3518; USA; DA. 1981; VOL. 29; NO 1; PP. 74-84; BIBL. 13 REF.Article

DISCRETE TRANSFORMS OVER POLYNOMIAL RINGS WITH APPLICATIONS IN COMPUTING MULTIDIMENSIONAL CONVOLUTIONSARAMBEPOLA B; RAYNER PJW.1980; I.E.E.E. TRANS. ACOUST. SPEECH SIGNAL PROCESSG; USA; DA. 1980; VOL. 28; NO 4; PP. 407-414; BIBL. 14 REF.Article

Another SAT to CSP conversionROUSSEL, Olivier.Proceedings - International Conference on Tools with Artificial Intelligence, TAI. 2004, pp 558-565, issn 1082-3409, isbn 0-7695-2236-X, 1Vol, 8 p.Conference Paper